package binarytree;

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;

public class Test {
    public static void main(String[] args) {
       binaryTree tree=new binaryTree();
       tree.createTree();
       LinkedList<Character> list=new LinkedList<>();
        list.contains('l');

       //层序遍历(√)
      // tree.levelOrder();
       //前序遍历(√)
       // tree.preOrder(tree.root);
        //中序遍历(√）
        //tree.inOrder(tree.root);
        //后续遍历(√)
        //tree.postOrde(tree.root);
        //求二叉树的节点数(√)
        //System.out.println("树的节点数："+tree.size(tree.root));
        //求二叉树叶子节点数目(√)
        //System.out.println("叶子节点数："+tree.getLeafNodeCount(tree.root));
        //求二叉树的高度(√)
        //System.out.println("二叉树的高度为"+tree.getHeight(tree.root));
        //检测值为key的元素是否存在(√)
        //System.out.println(tree.find(tree.root,'X').val);
    }
}
